Constraint satisfaction problems with isolated solutions are hard
نویسندگان
چکیده
منابع مشابه
Constraint satisfaction problems with isolated solutions are hard
We study the phase diagram and the algorithmic hardness of the random ‘locked’ constraint satisfaction problems, and compare them to the commonly studied ‘non-locked’ problems like satisfiability of Boolean formulae or graph coloring. The special property of the locked problems is that clusters of solutions are isolated points. This simplifies significantly the determination of the phase diagra...
متن کاملNumerical Constraint Satisfaction Problems with Non-isolated Solutions
In recent years, interval constraint-based solvers have shown their ability to efficiently solve complex instances of non-linear numerical CSPs. However, most of the working systems are designed to deliver point-wise solutions with an arbitrary accuracy. This works generally well for systems with isolated solutions but less well when there is a continuum of feasible points (e.g. underconstraine...
متن کاملModelling Exceptionally Hard Constraint Satisfaction Problems
Randomly-generated constraint satisfaction problems go through a phase transition as the constraint tightness varies. Loose constraints give an `easy-soluble' region, where problems have many solutions and are almost always easy to solve. However, in this region, systematic search algorithms may occasionally encounter problems which are extremely expensive to solve. It has been suggested that i...
متن کاملHard constraint satisfaction problems have hard gaps at location 1
An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed constraint types (or constraint languages) affe...
متن کاملStable Solutions for Dynamic Constraint Satisfaction Problems
An important extension of constraint technology involves problems that undergo changes that may invalidate the current solution. Previous work on dynamic problems sought methods for eeciently nding new solutions. We take a more proactive approach, exploring methods for nding solutions more likely to remain valid after changes that temporarily alter the set of valid assignments (stable solutions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2008
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2008/12/p12004